Thomson’s theorem on mean square polynomial approximation
نویسندگان
چکیده
منابع مشابه
Thomson’s Theorem on Mean Square Polynomial Approximation
In 1991, J. E. Thomson determined completely the structure of H2(μ), the closed subspace of L2(μ) that is spanned by the polynomials, whenever μ is a compactly supported measure in the complex plane. As a consequence he was able to show that if H2(μ) = L2(μ), then every function f ∈ H2(μ) admits an analytic extension to a fixed open set Ω, thereby confirming in this context a phenomenon noted e...
متن کاملMean-Square Filtering for Polynomial System States Confused with Poisson Noises over Polynomial Observations
In this paper, the mean-square filtering problem for polynomial system states confused with white Poisson noises over polynomial observations is studied proceeding from the general expression for the stochastic Ito differentials of the mean-square estimate and the error variance. In contrast to the previously obtained results, the paper deals with the general case of nonlinear polynomial states...
متن کاملThe Runge approximation theorem for generalized polynomial hulls
Where ||P ||K = sup{|P (z)| : z ∈ K}. It is known from the Runge approximation theorem that every function which is holomorphic in a neighborhood of compact sets K with K = K̂ can be approximated uniformly on K by analytic polynomials. Our aim here is to prove the same result in the more general situation when the rôle of K̂ is played by the generalized polynomial hull hq(K) introduced by Basener...
متن کاملMean square convergence analysis for kernel least mean square algorithm
In this paper, we study the mean square convergence of the kernel least mean square (KLMS). The fundamental energy conservation relation has been established in feature space. Starting from the energy conservation relation, we carry out the mean square convergence analysis and obtain several important theoretical results, including an upper bound on step size that guarantees the mean square con...
متن کاملOn the polynomial Lindenstrauss theorem
The Bishop-Phelps theorem [1] states that for any Banach space X, the set of norm attaining linear bounded functionals is dense in X ′, the dual space of X. Since then, the study of norm attaining functions has attracted the attention of many authors. Lindenstrauss showed in [2] that there is no Bishop-Phelps theorem for linear bounded operators. Nevertheless, he proved that the set of bounded ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: St. Petersburg Mathematical Journal
سال: 2006
ISSN: 1061-0022,1547-7371
DOI: 10.1090/s1061-0022-06-00901-0